ON BOTTLE-MAKERS' CATARACT

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Drawing Disconnected Graphs on the Klein Bottle

Résumé We prove that two disjoint graphs must always be drawn separately on the Klein bottle in order to minimize the crossing number of the whole drawing.

متن کامل

Glass Bottle Inspector Based on Machine Vision

This text studies glass bottle intelligent inspector based machine vision instead of manual inspection. The system structure is illustrated in detail in this paper. The text presents the method based on watershed transform methods to segment the possible defective regions and extract features of bottle wall by rules. Then wavelet transform are used to exact features of bottle finish from images...

متن کامل

The Klein Bottle: Variations on a Theme

It is a well-known fact that K is a genus 2 nonorientable closed surface with Euler characteristic χ = 0, which is topologically equivalent to a couple of Möbius bands glued together along the border, and that it is nonembeddable in R. It is possible, however, to immerse it in R, that is, to map it into R obtaining an image with no singular points. To give an immersion of K in R, it suffices to...

متن کامل

Five-coloring graphs on the Klein bottle

We exhibit an explicit list of nine graphs such that a graph drawn in the Klein bottle is 5-colorable if and only if it has no subgraph isomorphic to a member of the list. 31 August 2007, revised 18 January 2012. Partially supported by NSF under Grant No. DMS-0200595. Partially supported by NSF under Grants No. DMS-0200595, DMS-0354742, and DMS-0701077. Partially supported by NSF Graduate Fello...

متن کامل

6-Critical Graphs on the Klein Bottle

We provide a complete list of 6-critical graphs that can be embedded on the Klein bottle settling a problem of Thomassen [J. Combin. Theory Ser. B, 70 (1997), pp. 67–100, Problem 3]. The list consists of nine nonisomorphic graphs which have altogether 18 nonisomorphic 2-cell embeddings and one embedding that is not 2-cell.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMJ

سال: 1907

ISSN: 0959-8138,1468-5833

DOI: 10.1136/bmj.2.2433.381